Finding a Shortest Vector in a Two-dimensional Lattice modulo M
ثبت نشده
چکیده
We nd the shortest non-zero vector in the lattice of all integer multiples of the vector (a; b) modulo m, for given integers 0 < a; b < m. We reduce the problem to the computation of a Minkowski-reduced basis for a planar lattice and thereby show that the problem can be solved in O(log m(log logm) 2) bit operations.
منابع مشابه
Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m
We nd the shortest non-zero vector in the lattice of all integer multiples of the vector a; b modulo m, for given integers 0 < a ; b < m. W e reduce the problem to the computation of a Minkowski-reduced basis for a planar lattice and thereby show that the problem can be solved in Olog mlog logm 2 bit operations.
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملA : Lattice Algorithms and Applications Spring 2007 Lecture 4 : The LLL Algorithm
No efficient algorithm is known to find the shortest vector in a lattice (in arbitrary dimension), or even just computing its length λ1. A central tool in the algorithmic study of lattices (and their applications) is the LLL algorithm of Lenstra, Lenstra and Lovasz. The LLL algorithm runs in polynomial time and finds an approximate solution x to the shortest vector problem, in the sense that th...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملOrbits of Maximal Vector Spaces
Let V∞ be a standard computable infinite-dimensional vector space over the rationals. The lattice L(V∞) of computably enumerable vector subspaces of V∞, and its quotient lattice modulo finite dimension, L(V∞), have been extensively studied. However, many important questions still remain open. In 1998, R. Downey and J. Remmel posed the question of finding meaningful orbits in L(V∞) (Question 5.8...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997